Iterative Validation of Eigensolvers: A Scheme for Improving the Reliability of Hermitian Eigenvalue Solvers
نویسندگان
چکیده
Iterative eigenvalue solvers for large, sparse matrices may miss some of the required eigenvalues that are of high algebraic multiplicity or tightly clustered. Block methods, locking, a-posteriori validation, or simply increasing the required accuracy are often used to avoid missing or to detect a missed eigenvalue, but each has its own shortcomings in robustness or performance. To resolve these shortcomings, we have developed a postprocessing algorithm, iterative validation of eigensolvers (IVE), that combines the advantages of each technique. IVE detects numerically multiple eigenvalues among the approximate eigenvalues returned by a given solver, adjusts the block size accordingly, then calls the given solver using locking to compute a new approximation in the subspace orthogonal to the current approximate eigenvectors. This process is repeated until no additional missed eigenvalues can be identified. IVE is general and can be applied as a wrapper to any Rayleigh-Ritz-based, hermitian eigensolver. Our experiments show that IVE is very effective in computing missed eigenvalues even with eigensolvers that lack locking or block capabilities, although such capabilities may further enhance robustness. By focusing on robustness in a post-processing stage, IVE allows the user to decouple the notion of robustness from that of performance when choosing the block size or the convergence tolerance.
منابع مشابه
Gradient Flow Approach to Geometric Convergence Analysis of Preconditioned Eigensolvers
Preconditioned eigenvalue solvers (eigensolvers) are gaining popularity, but their convergence theory remains sparse and complex. We consider the simplest preconditioned eigensolver— the gradient iterative method with a fixed step size—for symmetric generalized eigenvalue problems, where we use the gradient of the Rayleigh quotient as an optimization direction. A sharp convergence rate bound fo...
متن کاملIterative Solution of Generalized Eigenvalue Problems from Optoelectronics with Trilinos
In this paper, we study the iterative solution of generalized Hermitian eigenvalue problems arising from the finite-element discretization of k·p models of optoelectronic nano systems. We are interested in computing the eigenvalues close to the band-gap which determine electronic and optical properties of a given system. Our work is based on the Trilinos project which provides an object-oriente...
متن کاملSpectral recycling strategies for the solution of nonlinear eigenproblems in thermoacoustics
In this work we consider the numerical solution of large nonlinear eigenvalue problems that arise in thermoacoustic simulations involved in the stability analysis of large combustion devices. We briefly introduce the physical modelling that leads to a nonlinear eigenvalue problem that is solved using a nonlinear fixed point iteration scheme. Each step of this nonlinear method requires the solut...
متن کاملar X iv : 0 80 1 . 30 99 v 3 [ m at h . N A ] 1 6 M ar 2 00 9 GRADIENT FLOW APPROACH TO GEOMETRIC CONVERGENCE
Preconditioned eigenvalue solvers (eigensolvers) are gaining popularity, but their convergence theory remains sparse and complex. We consider the simplest preconditioned eigensolver— the gradient iterative method with a fixed step size—for symmetric generalized eigenvalue problems, where we use the gradient of the Rayleigh quotient as an optimization direction. A sharp convergence rate bound fo...
متن کاملDynamical Systems and Non-Hermitian Iterative Eigensolvers
Simple preconditioned iterations can provide an efficient alternative to more elaborate eigenvalue algorithms. We observe that these simple methods can be viewed as forward Euler discretizations of well-known autonomous differential equations that enjoy appealing geometric properties. This connection facilitates novel results describing convergence of a class of preconditioned eigensolvers to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Scientific Computing
دوره 28 شماره
صفحات -
تاریخ انتشار 2006